A Formal C Memory Model for Separation Logic
نویسندگان
چکیده
منابع مشابه
Towards Formal Verification of Memory Properties using Separation Logic
With the recent dissemination of embedded systems, it has become important to verifiy low-level software such as specialized operating systems. However, such verifications are notoriously made difficult by complex memory management operations such as pointer arithmetic. As a first step towards the implementation of a verification tool, we show how one can formally verify an important property o...
متن کامل?Logic and Formal Ontology: Is the Final Formal Ontology Possible
Musa Akrami AbstractMany philosophers and logicians have contemplated the relationship between ontology and logic. The author of this paper, working within a Bolzanoan-Husserlian tradition of studying both ontology and logic, considers ontology as the science of the most general features of beings and the most general relations among them. He considers logic as the science concernin...
متن کاملParameterized Memory Models and Concurrent Separation Logic
In this paper, we formalize relaxed memory models by giving a parameterized operational semantics to a concurrent programming language. Behaviors of a program under a relaxed memory model are defined as behaviors of a set of related programs under the sequentially consistent model. This semantics is parameterized in the sense that different memory models can be obtained by using different relat...
متن کاملFormal verification of C systems code Structured types, separation logic and theorem proving
Systems code is almost universally written in the C programming language or a variant. C has a very low level of type and memory abstraction and formal reasoning about C systems code requires a memory model that is able to capture the semantics of C pointers and types. At the same time, proof-based verification demands abstraction, in particular from the aliasing and frame problems. In this pap...
متن کاملFormal Verification of a Memory Model for C-Like Imperative Languages
This paper presents a formal veri cation with the Coq proof assistant of a memory model for C -like imperative languages. This model de nes the memory layout and the operations that manage the memory. The model has been speci ed at two levels of abstraction and implemented as part of an ongoing certi cation in Coq of a moderatelyoptimising C compiler. Many properties of the memory have been ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2016
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-016-9369-1